Recognizing hyperelliptic graphs in polynomial time
نویسندگان
چکیده
Recently, a new set of multigraph parameters was defined, called “gonalities”. Gonality bears some similarity to treewidth, and is a relevant graph parameter for problems in number theory and multigraph algorithms. Multigraphs of gonality 1 are trees. We consider so-called “hyperelliptic graphs” (multigraphs of gonality 2) and provide a safe and complete sets of reduction rules for such multigraphs, showing that for three of the flavors of gonality, we can recognize hyperelliptic graphs in O(n logn+m) time, where n is the number of vertices and m the number of edges of the multigraph.
منابع مشابه
Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملRecognizing HHDS-Free Graphs
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In particular, we describe a simple O(nm)-time algorithm which determines whether a graph G on n vertices and m edges is HHDS-free. To the best of our knowledge, this is the first polynomial-time algorithm for recognizing this...
متن کاملRecognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid
We investigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, known as B0-VPG graphs. Recognizing these graphs is an NP-hard problem. In light of this, we focus on their subclasses. In the paper, we describe polynomial time algorithms for recognizing chordal B0-VPG graphs, and for recognizing B0-VPG graphs that have a representation on a grid ...
متن کاملCirculant Graphs: Recognizing and Isomorphism Testing in Polynomial Time
An algorithm is constructed for recognizing the circulant graphs and finding a canonical labeling for them in polynomial time. This algorithm also yields a cycle base of an arbitrary solvable permutation group. The consistency of the algorithm is based on a new result on the structure of Schur rings over a finite cyclic group. §
متن کامل∆k-Confluent and Ok-Confluent Graphs
In this paper we extend the concept of ∆-confluence to ∆k-confluence by allowing more generalized junctions, called ∆k-junctions. We present an algorithm for recognizing graphs that are ∆k-confluent. We then generalize ∆k-confluence to Ok-confluence by allowing non-intersecting chords within a junction, resulting in Ok-junctions. We present an algorithm for recognizing graphs that are Ok-conflu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.05670 شماره
صفحات -
تاریخ انتشار 2017